The clique and coclique numbers’ bounds based on the H-eigenvalues of uniform hypergraphs
نویسندگان
چکیده
In this paper, some inequality relations between the Laplacian/signless Laplacian H-eigenvalues and the clique/coclique numbers of uniform hypergraphs are presented. For a connected uniform hypergraph, some tight lower bounds on the largest Laplacian H+-eigenvalue and signless Laplacian H-eigenvalue related to the clique/coclique numbers are given. And some upper and lower bounds on the clique/coclique numbers related to the largest Laplacian/signless Laplacian H-eigenvalues are obtained. Also some bounds on the sum of the largest/smallest adjacency/Laplacian/signless Laplacian H-eigenvalues of a hypergraph and its complement hypergraph are showed. All these bounds are consistent with what we have known when k is equal to 2.
منابع مشابه
Directed domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملMulticolor Ramsey numbers for triple systems
Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K n yields a monochromatic copy of H. We investigate rk(H) when k grows and H is fixed. For nontrivial 3-uniform hypergraphs H, the function rk(H) ranges from √ 6k(1 + o(1)) to double exponential in k. We observe that rk(H) is polynomi...
متن کاملSome remarks on vertex Folkman numbers for hypergraphs
Let F (r,G) be the least order of H such that the clique number of H and G are equal and any r-coloring of the vertices of H yields a monochromatic and induced copy of G. The problem of bounding of F (r,G) was studied by several authors and it is well understood. In this note, we extend those results to uniform hypergraphs.
متن کامل